Matrix-Product Complementary dual Codes
نویسندگان
چکیده
Linear complementary dual codes (LCD) are linear codes satisfying C ∩C = {0}. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal matrices. Some asymptotic results are derived.
منابع مشابه
Constructions of optimal LCD codes over large finite fields
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction methods include random sampling in the orthogonal group, code extension, matrix product codes and projection over a self-dual basis.
متن کاملBinary linear complementary dual codes
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...
متن کاملComplementary Dual Subfield Linear Codes Over Finite Fields
Two families of complementary codes over finite fields q are studied, where 2 = q r is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and sufficient conditions for a linear code (resp., a subfield linear code) to be Hermitian complementary dual (resp., trace Hermitian complementary dual) are determined. Construct...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملConstacyclic and quasi-twisted Hermitian self-dual codes over finite fields
Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing xn − λ over Fq2 is given, where λ is a unit in Fq2 . Based on this factorization, the dimensions of the Hermitian hulls of λ-constacyclic codes of length n over Fq2 are determined. The characterization and enumeration of constacyclic Hermitian self-dual (resp., complementary dua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1604.03774 شماره
صفحات -
تاریخ انتشار 2016